Equitable Coloring and Equitable Choosability of Planar Graphs without 6- and 7-Cycles
نویسندگان
چکیده
A graph G is equitably k-choosable if for any k-uniform list assignment L, G is L-colorable and each color appears on at most d|V (G)|/ke vertices. A graph G is equitable kcolorable if G has a proper vertex coloring with k colors such that the size of the color classes differ by at most 1. In this paper, we prove that if G is a planar graph without 5and 7-cycles, then G is equitably k-choosable and equitably k-colorable where k ≥max{∆(G),7}. 2010 Mathematics Subject Classification: 05C15
منابع مشابه
Equitable ∆-Coloring of Planar Graphs without 4-cycles
In this paper, we prove that if G is a planar graph with maximum degree ∆ ≥ 7 and without 4-cycles, then G is equitably m-colorable for any m≥ ∆.
متن کاملChoosability and edge choosability of planar graphs without five cycles
It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l)h c oosable. @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-Choosability, Edge choosability, Degeneracy, Planar graph.
متن کاملOn Choosability with Separation of Planar Graphs with Forbidden Cycles
We study choosability with separation which is a constrained version of list coloring of graphs. A (k, d)-list assignment L of a graph G is a function that assigns to each vertex v a list L(v) of at least k colors and for any adjacent pair xy, the lists L(x) and L(y) share at most d colors. A graph G is (k, d)-choosable if there exists an L-coloring of G for every (k, d)-list assignment L. This...
متن کاملOn 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles
A graph is k-choosable if it can be colored whenever every vertex has a list of available colors of size at least k. It is a generalization of graph coloring where all vertices do not have the same available colors. We show that every triangle-free plane graph without 6-, 7-, and 8-cycles is 3-choosable.
متن کاملGroup edge choosability of planar graphs without adjacent short cycles
In this paper, we aim to introduce the group version of edge coloring and list edge coloring, and prove that all 2-degenerate graphs along with some planar graphs without adjacent short cycles is group (∆(G) + 1)-edgechoosable while some planar graphs with large girth and maximum degree is group ∆(G)-edge-choosable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 103 شماره
صفحات -
تاریخ انتشار 2012